Fair Bandwidth Allocation in Core-Stateless Networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Core Stateless Fair Bandwidth Allocation for Unicast and Multicast Flows

In this paper we aim at developing a solution to fairly allocating bandwidth among unicast and multicast flows. For this purpose, we propose the anycast max-min fairness criterion, which is based on the well known max-min fairness criterion for unicast. We then present an efficient implementation of the proposed criterion: the Multicast Fair Bandwidth Allocation (MFBA) architecture. The MFBA ar...

متن کامل

Core-stateless fair bandwidth allocation for TCP flows

The standard end-to-end flow control implemented by the TCP protocol is ill-suited when it comes to achieving fair bandwidth allocation among competing TCP flows. Indeed, the lack of feedback from intermediate nodes does not allow a TCP source to regulate its throughput so that it is not sending more than its fair share, thus penalizing other, less aggressive flows. In this paper, we propose a ...

متن کامل

Assuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks

Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve those characteristics but only at the expense of using per-flow states and signaling, which are not scalable and difficult to implement. Alternatively, the stateless approaches proposed up to now are focused either on prov...

متن کامل

Stateless Proportional Bandwidth Allocation

This paper proposes a new method of bandwidth allocation during congestion, called the proportional allocation of bandwidth. Traditionally, max-min fairness has been proposed to allocate bandwidth under congestion. Our allocation scheme considers the situation where flows might have different subscribed information rates, based on their origin. In proportional allocation of bandwidth, during co...

متن کامل

Core-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks

Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The KIPS Transactions:PartC

سال: 2005

ISSN: 1598-2858

DOI: 10.3745/kipstc.2005.12c.5.695